Fingerprint Synthesis: Evaluating Fingerprint Search at Scale
نویسندگان
چکیده
A database of a large number of fingerprint images is highly desired for designing and evaluating large scale fingerprint search algorithms. Compared to collecting a large number of real fingerprints, which is very costly in terms of time, effort and expense, and also involves stringent privacy issues, synthetic fingerprints can be generated at low cost and does not have any privacy issues to deal with. However, it is essential to show that the characteristics and appearance of real and synthetic fingerprint images are sufficiently similar. We propose a Generative Adversarial Network (GAN) to generate 512×512 rolled fingerprint images. Our generative model for rolled fingerprints is highly efficient (12ms/image) with characteristics of synthetic rolled prints close to real rolled images. Experimental results show that our model captures the properties of real rolled fingerprints in terms of (i) fingerprint image quality, (ii) distinctiveness and (iii) minutiae configuration. Our synthetic fingerprint images are more realistic than other approaches.
منابع مشابه
Synthesis of CdTe quantum dots coated with biocompatible materials and investigation of their identification Properties
Fingerprint identification or dactyloscopy is a method for human identification. The impressions left by a human finger on surfaces are not visible to naked eyes (latent fingerprint); therefore, they require revelation to become visible and identified. Within the last century, several fingerprint revelation techniques such as optical, physical, and chemical were studied. These traditional metho...
متن کاملUnstructured Fingerprint Database Matching Method Based on Grover's Quantum Algorithm
Traditional fingerprint matching has slow speed and low probability in search rate under large-scale and unstructured database background. In order to solve this problem, an advanced searching method based on Grover’s search algorithm is proposed. It improves the Oracle operator in Grover’s algorithm and transforms the database one into four registers: index register, quantum bit register which...
متن کاملEfficient fingerprint search based on database clustering
Fingerprint identification has been a great challenge due to its complex search of database. This paper proposes an efficient fingerprint search algorithm based on database clustering, which narrows down the search space of fine matching. Fingerprint is non-uniformly partitioned by a circular tessellation to compute a multi-scale orientation field as the main search feature. The average ridge d...
متن کاملAn Automatic Fingerprint Classification Algorithm
Manual fingerprint classification algorithms are very time consuming, and usually not accurate. Fast and accurate fingerprint classification is essential to each AFIS (Automatic Fingerprint Identification System). This paper investigates a fingerprint classification algorithm that reduces the complexity and costs associated with the fingerprint identification procedure. A new structural algorit...
متن کاملA Robust Strucutural Fingerprint Restoration
Fast and accurate ridge detection in fingerprints is essential to each AFIS (Automatic Fingerprint Identification System). Smudged furrows and cut ridges in the image of a finger print are major problems in any AFIS. This paper investigates a new online ridge detection method that reduces the complexity and costs associated with the fingerprint identification procedure. The noise in fingerprint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017